Fun tors for Proofs and Programs

نویسندگان

  • Jean-Christophe Filliâtre
  • Pierre Letouzey
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast and Accurate Con-Eigenvalue Algorithm for Optimal Rational Approximations

Abstra t. The need to ompute small on-eigenvalues and the asso iated on-eigenve tors of positive-de nite Cau hy matri es naturally arises when onstru ting rational approximations with a (near) optimally small L error. Spe i ally, given a rational fun tion with n poles in the unit disk, a rational approximation with m ≪ n poles in the unit disk may be obtained from the mth on-eigenve tor of an n...

متن کامل

Ìýô¹èöö××öúúòò Ööööö Óððð Blockinøóö×

Daniel C. Wang Andrew W. Appel Department of Computer S ien e Prin eton University Prin eton, NJ 08544 USA Abstra t By ombining existing type systems with standard typebased ompilation te hniques, we des ribe how to write strongly typed programs that in lude a fun tion that a ts as a tra ing garbage olle tor for the program. Sin e the garbage olle tor is an expli it fun tion, we do not need to ...

متن کامل

Category Theory to Yoneda's Lemma

This development proves Yoneda's lemma and aims to be readable by humans. It only defines what is needed for the lemma: categories, func-tors and natural transformations. Limits, adjunctions and other important concepts are not included. There is no explanation or discussion in this document. See [O'K04] for this and a survey of category theory formalisations.

متن کامل

External Reviews, Internal Influences: Consultations and the Undergraduate Neuroscience Curriculum

In 2007 FUN established the FUN Program and Department Consultations Service, or FUN-PDCS. Since that founding, the service has provided numerous consultation recommendations to undergraduate programs seeking assistance with external program reviews, designing and improving courses and many other programmatic needs. FUN-PDCS, like FUN, is primarily a grassroots organization and draws on the exp...

متن کامل

Fun With Tilings

Tilings are defined inductively. It is shown that one form of mutilated chess board cannot be tiled with dominoes, while another one can be tiled with L-shaped tiles. Sections 1 and 2 are by Paulson and described elsewhere [1]. Section 3 is by Nipkow and formalizes a well-known argument from the literature [2]. Please add further fun examples of this kind! theory Tilings imports Main begin

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003